Listar por autor 

Listar por autor "Kynčl, Jan"  

Mostrando ítems 1-4 de 4

    • Ponencia
      Icon

      Improved enumeration of simple topological graphs 

      Kynčl, Jan (2013)
      A simple topological graph T = (V (T ), E(T )) is a drawing of a graph in the plane where every two edges have at most one ...
    • Ponencia
      Icon

      Monotone crossing number of complete graphs 

      Balko, Martin; Fulek, Radoslav; Kynčl, Jan (2013)
      In 1958, Hill conjectured that the minimum number of crossings in a drawing of Kn is exactly Z(n) = 1/4 n-1/2/2 n−2/2 ...
    • Ponencia
      Icon

      On the nonexistence of k-reptile simplices in R3 and R4 

      Kynčl, Jan; Safernova, Zuzana (2013)
      A d-dimensional simplex S is called a k-reptile (or a k-reptile simplex) if it can be tiled without overlaps by k simplices ...
    • Ponencia
      Icon

      On three parameters of invisibility graphs 

      Cibulka, Josef; Korbelář, Miroslav; Kynčl, Jan; Mészáros, Viola; Stolař, Rudolf; Valtr, Pavel (2013)
      The invisibility graph I(X) of a set X ⊆ Rd is a (possibly infinite) graph whose vertices are the points of X and two ...